public class twoTree {
    int le = 0;
    public int size(int[] arr) {
        for (int i = 0; i < arr.length; i++) {
            le++;
        }
        return le;
    }
}
